Automorphism group and diameter of a graph
نویسندگان
چکیده
Given a connected graph Γ of order n and diameter d, we establish a tight upper bound for the order of the automorphism group of Γ as a function of n and d, and determine the graphs for which the bound is attained.
منابع مشابه
A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملTHE AUTOMORPHISM GROUP OF FINITE GRAPHS
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملOn Symmetry of Some Nano Structures
It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 70 شماره
صفحات -
تاریخ انتشار 2012